A Unification and Generalization of Exact Distributed First-Order Methods
نویسندگان
چکیده
منابع مشابه
A Unification, Generalization, and Acceleration of Exact Distributed First Order Methods
Recently, there has been significant progress in the development of distributed first order methods. (At least) two different types of methods, designed from very different perspectives, have been proposed that achieve both exact and linear convergence when a constant step size is used – a favorable feature that was not achievable by most prior methods. In this paper, we unify, generalize, and ...
متن کاملFast Distributed First-Order Methods
This thesis provides a systematic framework for the development and analysis of distributed optimization methods for multi-agent networks with time-varying connectivity. The goal is to optimize a global objective function which is the sum of local objective functions privately known to individual agents. In our methods, each agent iteratively updates its estimate of the global optimum by optimi...
متن کاملa generalization of strong causality
در این رساله t_n - علیت قوی تعریف می شود. این رده ها در جدول علیت فضا- زمان بین علیت پایدار و علیت قوی قرار دارند. یک قضیه برای رده بندی آنها ثابت می شود و t_n- علیت قوی با رده های علی کارتر مقایسه می شود. همچنین ثابت می شود که علیت فشرده پایدار از t_n - علیت قوی نتیجه می شود. بعلاوه به بررسی رابطه نظریه دامنه ها با نسبیت عام می پردازیم و ثابت می کنیم که نوع خاصی از فضا- زمان های علی پایدار, ب...
Toward unification of exact and heuristic optimization methods
This paper argues that many exact and heuristic methods have common structure that permits some degree of unification. It interprets solution algorithms as primal-dual methods in which the primal component searches over problem restrictions, and the dual component obtains bounds on the optimal value. In particular, the concept of an inference dual provides the basis for constraint-directed sear...
متن کاملFirst-Order Unification on Compressed Terms
Singleton Tree Grammars (STGs) have recently drawn considerable attention. They generalize the sharing of subtrees known from DAGs to sharing of connected subgraphs. This allows to obtain smaller in-memory representations of trees than with DAGs. In the past years some important tree algorithms were proved to perform efficiently (without decompression) over STGs; e.g., type checking, equivalenc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal and Information Processing over Networks
سال: 2019
ISSN: 2373-776X,2373-7778
DOI: 10.1109/tsipn.2018.2846183